One Useful Logic That Defines Its Own Truth

نویسندگان

  • Andreas Blass
  • Yuri Gurevich
چکیده

Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those properties is rather unusual: truth of formulas can be defined (given appropriate syntactic apparatus) in the logic. We mentioned that property elsewhere, and we use this opportunity to provide the proof. Believe those who are seeking the truth. Doubt those who find it.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supervaluation Fixed-Point Logics of Truth

Abstract. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong Kleene fixed-point logic of truth and the weak Kleene fixed-point logic of truth, but leaves the axiomatizability question open for the supervaluation fixed-point logic of truth and its variants. We show that t...

متن کامل

Philip Kremer and Alasdair Urquhart Supervaluation Fixed-point Logics of Truth

Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong Kleene fixed-point logic of truth and the weak Kleene fixed-point logic of truth, but leaves the axiomatizability question open for the supervaluation fixed-point logic of truth and its variants. We show that the princip...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Multi-adjoint Fuzzy Logic Programming with Defaults and Constructive Answers

In this paper we present the semantics of RFuzzy, a fuzzy Logic Programming framework that represents truth values using real numbers from the unit interval. RFuzzy provides some useful extensions: default values to represent missing information, and typed arguments to intuitively restrict predicate domains. Together, they allow the system to provide constructive answers when querying for indiv...

متن کامل

The Truth Is Sometimes Simple

Note: The following version of this paper does not contain the proofs of the stated theorems. A longer version, complete with proofs, is forthcoming. §1. Introduction. In "The truth is never simple" (1986) and its addendum (1988), Burgess conducts a breathtakingly comprehensive survey of the complexity of the set of truths which arise when you add a truth predicate to arithmetic, and interpret ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008